Input-Distribution-Aware Successive Cancellation List Decoding of Polar Codes

نویسندگان

چکیده

Polar codes are linear block that can achieve channel capacity at infinite code length. Successive cancellation list (SCL) decoding relies on a set of parallel decoders; it yields good error-correction performance finite length, the cost increased implementation complexity and power consumption. Current efforts in literature focus design-time decoder reduction, while lacking practical run-time reduction methods. In this work, input-distribution-aware SCL (IDA-SCL) is proposed, allows to determine parallelism adopt by performing simple observations input decoder. This technique guarantees fixed, short latency hardware decoders dynamically shut down part internal before each process. It be combined with existing complexity- power- techniques. Simulation results show IDA-SCL reduce up 50%.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity-Achievability of Polar Codes under Successive Cancellation List Decoding

Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\i}kan. The performance of the successive cancellation list decoder is encou...

متن کامل

Study on Successive Cancellation Decoding of Polar Codes

Thanks to the property of provably capacityachieving, the recently-discovered polar codes are being taken many attentions. The Successive Cancellation (SC) is the first and widely known decoding for polar codes. In the paper, we study the decoding beginning with its recursive formula. Compared with previous works, our study is more strict and many fresh results are presented which would be help...

متن کامل

Partitioned Successive-Cancellation Flip Decoding of Polar Codes

Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre errorcorrection performance at moderate code length. In order to improve the error-correction performance of SC, two approaches are available: (i) SC-List dec...

متن کامل

Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution

Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for 5 generation wireless communication standards. Successive-cancellation (SC) decoding of polar codes has mediocre error-correction performance on short to moderate codeword lengths: the SC-Flip decoding algorithm is one of the solutions that have been proposed to o...

متن کامل

On Path Memory in List Successive Cancellation Decoder of Polar Codes

Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management. In the stateof-the-art designs, the memories are implemented with registers and a large crossbar is u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2021

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2021.3051463